A template for low-complexity implementation of POPMUSIC
نویسندگان
چکیده
Abstract POPMUSIC is a template for creating heuristics specially designed for dealing with large combinatorial problems that can be partially optimized. The basic idea is to optimize sub-parts of solutions until a local optimum is reached. The useful computational effort should be spent for optimizing these sub-parts. However, it is observed in practice that this computational effort grows almost linearly with problem size while the extraction of sub-parts has an higher algorithmic complexity. This work proposes a template for extracting sub-parts also in linear time.
منابع مشابه
Popmusic for the World Location Routing Problem
ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labeling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template...
متن کاملیک روش جستجوی دو- مرحلهای برای همزمانی سریع سیستمهای باند فوق وسیع در محیطهای چندمسیره
Ultra-wideband (UWB) radio is a promising technology for low-cost, high-rate communications at short ranges. However, high bandwidth and low power of the UWB signals impose some difficult challenges in signal processing and implementation of the receiver. Acquisition of the signal timing is the first task to be performed in a coherent receiver. The high bandwidth of UWB signals demand for fine ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملTowards a Matheuristic Approach for the Berth Allocation Problem
The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. For solving it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programmi...
متن کاملFPGA Implementation of a Hammerstein Based Digital Predistorter for Linearizing RF Power Amplifiers with Memory Effects
Power amplifiers (PAs) are inherently nonlinear elements and digital predistortion is a highly cost-effective approach to linearize them. Although most existing architectures assume that the PA has a memoryless nonlinearity, memory effects of the PAs in many applications ,such as wideband code-division multiple access (WCDMA) or orthogonal frequency-division multiplexing (OFDM), can no longer b...
متن کامل